Hausdorff dimension and oracle constructions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hausdorff dimension and oracle constructions

Bennett and Gill (1981) proved that P 6= NP relative to a random oracle A, or in other words, that the set O[P=NP] = {A | P = NP} has Lebesgue measure 0. In contrast, we show that O[P=NP] has Hausdorff dimension 1. This follows from a much more general theorem: if there is a relativizable and paddable oracle construction for a complexity-theoretic statement Φ, then the set of oracles relative t...

متن کامل

The Hausdorff dimension of some snowflake-like recursive constructions

Fractal subsets of Rn with highly regular structure are often constructed as a limit of a recursive procedure based on contractive maps. The Hausdorff dimension of recursively constructed fractals is relatively easy to find when the contractive maps associated with each recursive step satisfy the Open Set Condition (OSC). We present a class of random recursive constructions which resemble snowf...

متن کامل

Historic set carries full hausdorff dimension

‎We prove that the historic set for ratio‎ ‎of Birkhoff average is either empty or full of Hausdorff dimension in a class of one dimensional‎ ‎non-uniformly hyperbolic dynamical systems.

متن کامل

Extremal Manifolds and Hausdorff Dimension

The best possible lower bound for the Hausdorff dimension of the set of v-approximable points on a C extremal manifold is obtained.

متن کامل

Hausdorff dimension and Diophantine approximation

In the present survey paper, we explain how the theory of Hausdorff dimension and Hausdorff measure is used to answer certain questions in Diophantine approximation. The final section is devoted to a discussion around the Diophantine properties of the points lying in the middle third Cantor set.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2006

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2006.01.025